منابع مشابه
Learning and Information Aggregation in an Exit Game∗
We analyze information aggregation in a stopping game with uncertain common payoffs. Players learn from their own private experiences as well as by observing the actions of other players. We give a full characterization of the symmetric mixed strategy equilibrium, and show that information aggregates in randomly occurring exit waves. Observational learning induces the players to stay in the gam...
متن کاملInformation-Revelation and Coordination Using Cheap Talk in a Game with Two-Sided Private Information
We consider a Bayesian game, namely the Battle of the Sexes with private information, in which each player has two types, High and Low. We allow cheap talk regarding players’ types before the game and prove that the unique fully revealing symmetric cheap talk equilibrium exists for a low range of prior probability of the High-type. This equilibrium has a desirable type-coordination property : i...
متن کاملThreshold uncertainty in the private-information subscription game
We introduce threshold uncertainty, à la Nitzan and Romano (1990), into a private-values model of voluntary provision of a discrete public good. Players are allowed to make any level of contribution toward funding the good, which is provided if the cost threshold is reached. Otherwise, contributions are refunded. Conditions ensuring existence and uniqueness of a Bayesian equilibrium are establi...
متن کاملOn a private information game without pure strategy equilibria
We present an example of a two-person game of private information in which there is no equilibrium in pure strategies. Our example satisfies all the hypotheses of the existence theorems present in the literature on the subject of pure strategy equilibria, except for the w x fact that the action set of each player is given by the interval y1,1 . As such, it illustrates the limitations that perta...
متن کاملThe Capacity of Private Information Retrieval with Private Side Information
The problem of private information retrieval with private side information (PIR-PSI) is recently introduced by Kadhe et al. In this problem, N replicated databases each store K messages, of which M are known to the user as side-information. The identity of these M messages is unknown to the databases. The user wishes to retrieve, as efficiently as possible, a new desired message without reveali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4239180